Breaking an orbit-based symmetric cryptosystem

نویسندگان

  • Ercan Solak
  • Rhouma Rhouma
  • Safya Belghith
چکیده

We report a break for a recently proposed class of cryptosystems. The cryptosystem uses constant points of a periodic secret orbit to encrypt the plaintext. In order to break the system, it suffices to sort the constant points and find the initial fixed point. We also report breaks for the modified versions of the cryptosystem. Besides, we discuss some efficiency issues of the the cryptosystem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel orbit based symmetric cryptosystems

During the last few years considerable effort has been devoted to research related to chaotic encryption. In this paper a new symmetric key cryptosystem that exploits the idea of nonlinear mappings and their fixed points to encrypt information is presented. Furthermore, a measure of the quality of the keys used is introduced. The experimental results indicate that the proposed cryptosystem is e...

متن کامل

Breaking Public Keys - How to Determine an Unknown RSA Public Modulus

Not surprisingly, the common use of any public key crypto system involves publishing the public key and keeping the private key secret. There are however a few applications where both the private and public key are kept secret, thereby effectively converting a public key crypto algorithm to a symmetric algorithm. We show that if the RSA cryptosystem is used in such a symmetric application, it i...

متن کامل

An Efficient and Secure Cryptosystem for Encrypting Long Messages

Traditionally, due to efficiency considerations, when encrypting long messages using an asymmtric cryptosystem, one needs to use a symmetric cryptosystem in addition. To eliminate this requirement, Hwang, Chang, and Hwang introduced an asymmetric cryptosystem for encrypting long messages. However, they did not give any formal proof of the security of this cryptosystem. In this paper, we propose...

متن کامل

A Cryptosystem Based on Hilbert Matrix using Cipher Block Chaining Mode

Cryptography is the science of using mathematics to encrypt and decrypt data. Cryptography enables you to store sensitive information or transmit it across insecure networks so that it cannot be read by anyone except the intended recipient. While cryptography is the science of securing data, cryptanalysis is the science of analyzing and breaking secure communication. Classical cryptanalysis inv...

متن کامل

Counting Symmetry Breaking Solutions to Symmetric Variational Problems

TO SYMMETRIC VARIATIONAL PROBLEMS Giuseppe Gaeta Department of Mathematical Sciences Loughborough University of Technology Loughborough LE11 3TU (England) [email protected] Summary By combining the Michel's geometric theory of symmetry breaking and classical result from variational analysis, we obtain a lower bound on critical points with given symmetry H G of a potential symmetric under G. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical and Computer Modelling

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2011